Network Community Detection on Metric Space
نویسندگان
چکیده
منابع مشابه
Network Community Detection on Metric Space
Community detection in a complex network is an important problem of much interest in recent years. In general, a community detection algorithm chooses an objective function and captures the communities of the network by optimizing the objective function, and then, one uses various heuristics to solve the optimization problem to extract the interesting communities for the user. In this article, ...
متن کاملNearest Neighbor Search in the Metric Space of a Complex Network for Community Detection
The objective of this article is to bridge the gap between two important research directions: (1) nearest neighbor search, which is a fundamental computational tool for large data analysis; and (2) complex network analysis, which deals with large real graphs but is generally studied via graph theoretic analysis or spectral analysis. In this article, we have studied the nearest neighbor search p...
متن کاملADMITTING CENTER MAPS ON MULTIPLICATIVE METRIC SPACE
In this work, we investigate admitting center map on multiplicative metric space and establish some fixed point theorems for such maps. We modify the Banach contraction principle and the Caristi's fixed point theorem for M-contraction admitting center maps and we prove some useful theorems. Our results on multiplicative metric space improve and modify s...
متن کاملDistributed Community Detection with the WCC Metric
Community detection has become an extremely active area of research in recent years, with researchers proposing various new metrics and algorithms to address the problem. Recently, the Weighted Community Clustering (WCC) metric was proposed as a novel way to judge the quality of a community partitioning based on the distribution of triangles in the graph, and was demonstrated to yield superior ...
متن کاملOverlapping Community Detection based on Network Decomposition
Community detection in complex network has become a vital step to understand the structure and dynamics of networks in various fields. However, traditional node clustering and relatively new proposed link clustering methods have inherent drawbacks to discover overlapping communities. Node clustering is inadequate to capture the pervasive overlaps, while link clustering is often criticized due t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2015
ISSN: 1999-4893
DOI: 10.3390/a8030680